#define _CRT_SECURE_NO_WARNINGS 1
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include<math.h>
#include<stdlib.h>
#include<stdio.h>
#include<unordered_map>
#include<queue>
#include<stack>
#include <functional>
#include <memory>
using namespace std;

class Solution {
public:
    int findSubstringInWraproundString(string s) {
        int n = s.size();
        vector<int> dp(n, 1);
        int ret = 0;
        int hash[30] = { 0 };
        hash[s[0] - 'a'] = 1;
        for (int i = 1; i < n; i++)
        {
            dp[i] = (((s[i - 1] - 'a' + 1) % 26 - (s[i] - 'a') % 26) == 0) ? dp[i - 1] + 1 : 1;
            hash[s[i] - 'a'] = max(hash[s[i] - 'a'], dp[i]);
        }
        for (int i = 0; i < 26; i++)
            ret += hash[i];
        return ret;
    }
};

int main()
{
	cout << ('z' - 'a' + 1) % 26 << endl;
	cout << ('a' - 'a' + 1) % 26 << endl;
	return 0;
}